Solving Bandwidth-Guaranteed Routing Problem Using Routing Data
نویسندگان
چکیده
منابع مشابه
Solving bandwidth-guaranteed routing problem using routing data
This paper introduces a traffic engineering routing algorithm that aims to accept as many routing demands as possible on the condition that a certain amount of bandwidth resource is reserved for each accepted demand. The novel idea is to select routes based on not only network states but also information derived from routing data such as probabilities of the ingress egress pairs and usage frequ...
متن کاملAn Efficient Scheme for Solving Bandwidth Guaranteed Scheduling and Shortest path Routing Problem in Wireless Mesh Networks
The bandwidth problem is one of the most serious problems for multi-hop wireless mesh networks (WMNs) due to the influence of link interference. In this paper, we study joint problem of interference-aware bandwidth guaranteed scheduling and shortest path routing in IEEE 802.11-based multi-channel wireless mesh networks with dynamic traffic. We present distributed bandwidth guaranteed TDMA sched...
متن کاملBandwidth Guaranteed Hop-by-Hop Routing in Wireless Mesh Networks
Wireless Mesh Network (WMN) has become an important edge network to provide Internet access to remote areas and wireless connections in a metropolitan scale. In this paper, we study the problem of identifying the maximum available bandwidth path, a fundamental issue in supporting quality-of-service in WMNs. Due to interference among links, bandwidth, a well-known bottleneck metric in wired netw...
متن کاملA Load Profiling Approach to Routing Guaranteed Bandwidth Flows
We study a new approach to routing multi-class traf-c ows with guaranteed bandwidth requirements. The approach is based on our recently proposed concept of load prooling 4]. We thoroughly characterize routing performance using load prooling and contrast it to routing using load balancing and load packing. We do so both analytically and via extensive simulations on Virtual Path (VP) based networ...
متن کاملNew Bandwidth Guaranteed QoS Routing Algorithm for MPLS Networks
Internet has become an integrated carrier gradually, which has multi business such as data, voice, video, multimedia and so on. New multimedia applications require the network to guarantee quality of service. MPLS network has the capability of routing with some specific constraints for supporting desired QoS, out of which bandwidth is the most important constraint. The efficient routing algorit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International journal of Computer Networks & Communications
سال: 2014
ISSN: 0975-2293,0974-9322
DOI: 10.5121/ijcnc.2014.6607